A nonmonotone flexible filter method for nonlinear constrained optimization
نویسندگان
چکیده
منابع مشابه
Nonmonotone Filter Method for Nonlinear Optimization
We propose a new nonmonotone filter method to promote global and fast local convergence for sequential quadratic programming algorithms. Our method uses two filters: a global gfilter for global convergence, and a local nonmonotone l-filter that allows us to establish fast local convergence. We show how to switch between the two filters efficiently, and we prove global and superlinear local conv...
متن کاملGlobal convergence of a nonmonotone filter method for equality constrained optimization
A new nonmonotone filter trust region method is introduced for solving optimization problems with equality constraints. This method directly uses the dominated area of the filter as an acceptability criterion for trial points and allows the dominated area decreasing nonmonotonically. Compared with the filter-type method, our method has more flexible criteria and can avoidMaratos effect in a cer...
متن کاملAn Improved Nonmonotone Filter Trust Region Method for Equality Constrained Optimization
and Applied Analysis 3 2.3. The Improved Accepted Condition for d k . Borrowed from the usual trust region idea, we also need to define the following predicted reduction for the violation function h(x) = ‖c(x)‖ 2 predc k = h (x k ) − c k + A T
متن کاملFlexible Penalty Functions for Nonlinear Constrained Optimization
[Received on 31 March 2007] We propose a globalization strategy for nonlinear constrained optimization. The method employs a “flexible” penalty function to promote convergence, where during each iteration the penalty parameter can be chosen as any number within a prescribed interval, rather than a fixed value. This increased flexibility in the step acceptance procedure is designed to promote lo...
متن کاملAugmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
At each outer iteration of standard Augmented Lagrangian methods one tries to solve a box-constrained optimization problem with some prescribed tolerance. In the continuous world, using exact arithmetic, this subproblem is always solvable. Therefore, the possibility of finishing the subproblem resolution without satisfying the theoretical stopping conditions is not contemplated in usual converg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics in Industry
سال: 2016
ISSN: 2190-5983
DOI: 10.1186/s13362-016-0029-1